منابع مشابه
Contextual Grammars with Distributed Catenation and Shuffle
We introduce a new type of contextual grammars. Instead of considering the catenation operation we use the distributed catenation operation. The contexts are distributed catenated with words from the language, de ning in this way new words from the language. We investigate several properties of the languages generated by distributed catenated contextual grammars. Finally, we also present the re...
متن کاملState Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation
In this paper, we show that, due to the structural properties of the resulting automaton obtained from a prior operation, the state complexity of a combined operation may not be equal but close to the mathematical composition of the state complexities of its component operations. In particular, we provide two witness combined operations: reversal combined with catenation and star combined with ...
متن کاملState Complexity of Orthogonal Catenation
A language L is the orthogonal catenation of languages L1 and L2 if every word of L can be written in a unique way as a catenation of a word in L1 and a word in L2. We establish a tight bound for the state complexity of orthogonal catenation of regular languages. The bound is smaller than the bound for arbitrary catenation.
متن کاملState Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection
In this paper, we study the state complexities of two particular combinations of operations: catenation combined with union and catenation combined with intersection. We show that the state complexity of the former combined operation is considerably less than the mathematical composition of the state complexities of catenation and union, while the state complexity of the latter one is equal to ...
متن کاملState Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal
This paper is a continuation of our research work on state complexity of combined operations. Motivated by applications, we study the state complexities of two particular combined operations: catenation combined with star and catenation combined with reversal. We show that the state complexities of both of these combined operations are considerably less than the compositions of the state comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00284-3